﻿
namespace Leetcode.N1672;

public class Solution
{
    public int MaximumWealth(int[][] accounts)
    {
        var max = 0;
        for (int i = 0; i < accounts.Length; i++)
        {
            var sum = 0;
            for (int j = 0; j < accounts[i].Length; j++)
            {
                sum += accounts[i][j];
            }
            max = Math.Max(max, sum);
        }
        return max;
    }
}
